Majority Vote and Other Problems when using Computational Tools

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining Fuzzy partitions Using Fuzzy Majority Vote and KNN

this paper firstly generalizes majority vote to fuzzy majority vote, then proposes a cluster matching algorithm that is able to establish correspondence among fuzzy clusters from different fuzzy partitions over a common data set. Finally a new combination model of fuzzy partitions is build on the basis of the proposed cluster matching algorithm and fuzzy majority vote. Comparative results show ...

متن کامل

Majority vote following a debate

Voters determine their preferences over alternatives based on cases (or arguments) that are raised in the public debate. Each voter is characterized by a matrix, measuring how much support each case lends to each alternative, and her ranking is additive in cases. We show that the majority vote in such a society can be any function from sets of cases to binary relations over alternatives. A simi...

متن کامل

Majority Vote Algorithm Revisited Again

In his article Experience with Software Specification and Verification Using LP, the Larch Proof Assistant, Manfred Broy verified (as one of his smaller case studies) the Majority Vote Algorithm by Boyer and Moore. LP requires that all user theories are expressed axiomatically. I reworked the example in Isabelle/HOL and turned it into a definitional development, thus proving its consistency. In...

متن کامل

Multisymbol Majority Vote and Hard Core

This paper describes a weak sense majority-vote technique for a k symbol function g(z) as follows. If a probabilistic polynomial time algorithm A exists such that Pr[A(z) = g(z)] 1=k + , then s 4 = 2 k 1 1 probabilistic polynomial time algorithms f ^ A 1 ; : : : ; ^ A s g exist such that for 8z 2 f0; : : : ; k 1g , there exists ^ A i 2 f ^ A 1 ; : : : ; ^ A s g such that Pr[ ^ A i (z) = g(z)] 1...

متن کامل

A Weighted Majority Vote Strategy Using Bayesian Networks

Most of the methods for combining classifiers rely on the assumption that the experts to be combined make uncorrelated errors. Unfortunately, this theoretical assumption is not easy to satisfy in practical cases, thus effecting the performance obtainable by applying any combination strategy. We tried to solve this problem by explicitly modeling the dependencies among the experts through the est...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Human Mutation

سال: 2014

ISSN: 1059-7794

DOI: 10.1002/humu.22600